Solving Simple Stochastic Games with Few Random Vertices
نویسندگان
چکیده
منابع مشابه
Solving Simple Stochastic Games with Few Random Vertices
Simple stochastic games are two-player zero-sum stochastic games with turnbased moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them rely on the existence of optimal permutation strategies, a class of positional strategies derived from permutations of the random vertices. The “permutation-enu...
متن کاملSimple Stochastic Games with Few Random Vertices Are Easy to Solve
We present a new algorithm for solving Simple Stochastic Games (SSGs). This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (|V ||E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of vertices, random vertices and edges, and the maximum bit-length of a transition probability. Our ...
متن کاملSolving Simple Stochastic Games with Few Coin Toss Positions
Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O(r!n) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out that a variant of strategy iteration can be implemented to solve this problem in time 4rn. In this paper, we show that an algorithm combining value iteration ...
متن کاملSolving Simple Stochastic Games
We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (log(|V |)|E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of ver...
متن کاملNew Algorithms for Solving Simple Stochastic Games
We present new algorithms for determining optimal strategies for two-player games with probabilistic moves and reachability winning conditions. Such games, known as simple stochastic games, were extensively studied by A.Condon [2,3]. Many interesting problems, including parity games and hence also mu-calculus model checking, can be reduced to simple stochastic games. It is an open problem, whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(2:9)2009